منابع مشابه
islanding detection methods for microgrids
امروزه استفاده از منابع انرژی پراکنده کاربرد وسیعی یافته است . اگر چه این منابع بسیاری از مشکلات شبکه را حل می کنند اما زیاد شدن آنها مسائل فراوانی برای سیستم قدرت به همراه دارد . استفاده از میکروشبکه راه حلی است که علاوه بر استفاده از مزایای منابع انرژی پراکنده برخی از مشکلات ایجاد شده توسط آنها را نیز منتفی می کند . همچنین میکروشبکه ها کیفیت برق و قابلیت اطمینان تامین انرژی مشترکان را افزایش ...
15 صفحه اولPrime Ideal Theorem for Double Boolean Algebras
Double Boolean algebras are algebras (D,u,t, , ,⊥,>) of type (2, 2, 1, 1, 0, 0). They have been introduced to capture the equational theory of the algebra of protoconcepts. A filter (resp. an ideal) of a double Boolean algebra D is an upper set F (resp. down set I) closed under u (resp. t). A filter F is called primary if F 6= ∅ and for all x ∈ D we have x ∈ F or x ∈ F . In this note we prove t...
متن کاملGeneralized iterative methods for solving double saddle point problem
In this paper, we develop some stationary iterative schemes in block forms for solving double saddle point problem. To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition. Moreover, using a relaxation parameter, the weighted version of the Jacobi method together with its convergence analysis are considered. Furthermore, we extend a method...
متن کاملCharacterizing Propagation Methods for Boolean Satisfiability
Iterative algorithms such as Belief Propagation and Survey Propagation can handle some of the largest randomly-generated satisfiability problems (SAT) created to this point. But they can make inaccurate estimates or fail to converge on instances whose underlying constraint graphs contain small loops–a particularly strong concern with structured problems. More generally, their behavior is only w...
متن کاملBoolean Bounding Predicates for Spatial Access Methods
Tree-based multidimensional indexes are integral to efficient querying in multimedia and GIS applications. These indexes frequently use shapes in internal tree nodes to describe the data stored in a subtree below. We show that the standard Minimum Bounding Rectangle descriptor can lead to significant inefficiency during tree traversal, due to false positives. We also observe that there is often...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1990
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1990-1035928-7